Time complexity

Results: 894



#Item
11Theory of Evolutionary Algorithms for Combinatorial Optimisation Pietro S. Oliveto University of Sheffield  Midlands Graduate School

Theory of Evolutionary Algorithms for Combinatorial Optimisation Pietro S. Oliveto University of Sheffield Midlands Graduate School

Add to Reading List

Source URL: staffwww.dcs.shef.ac.uk

Language: English - Date: 2014-04-26 08:50:17
12DYNAMICAL SYSTEMS THEORY IN OUTDOOR EXPERIENTIAL EDUCATION 	
   The Complexity of Outdoor Experiential Education: Using Dynamical Systems Theory in Outdoor Experiential Education Jeremy Jostad

DYNAMICAL SYSTEMS THEORY IN OUTDOOR EXPERIENTIAL EDUCATION   The Complexity of Outdoor Experiential Education: Using Dynamical Systems Theory in Outdoor Experiential Education Jeremy Jostad

Add to Reading List

Source URL: rendezvous.nols.edu

Language: English - Date: 2015-11-05 13:02:10
13CSE 181 Project guidelines

CSE 181 Project guidelines

Add to Reading List

Source URL: www.cs.bilkent.edu.tr

Language: English - Date: 2012-10-16 07:22:21
14arXiv:1505.04514v1 [cs.DC] 18 MayA Local Broadcast Layer for the SINR Network Model Magn´ us M. Halld´orsson∗

arXiv:1505.04514v1 [cs.DC] 18 MayA Local Broadcast Layer for the SINR Network Model Magn´ us M. Halld´orsson∗

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2015-05-18 20:53:11
15Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is

Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is

Add to Reading List

Source URL: www.cse.iitk.ac.in

Language: English - Date: 2016-07-30 09:35:21
16CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-01-06 16:13:01
17comput. complex), 281 – 040281–27 DOIs00037c Birkh¨

comput. complex), 281 – 040281–27 DOIs00037c Birkh¨

Add to Reading List

Source URL: www.cs.huji.ac.il

Language: English - Date: 2014-11-26 08:32:22
18In This Time of Complexity and Challenge NEAL A. MAXWELL Now, ladies and gentlemen, brothers and sisters, may I in conclusion use only very briefly the prerogative extended to me in order to

In This Time of Complexity and Challenge NEAL A. MAXWELL Now, ladies and gentlemen, brothers and sisters, may I in conclusion use only very briefly the prerogative extended to me in order to

Add to Reading List

Source URL: speeches.byu.edu

Language: English - Date: 2016-05-26 19:38:05
19Single-Pass List Partitioning Leonor Frias ∗ Universitat Polit`ecnica de Catalunya Dep. de Llenguatges i Sistemes Inform`atics Jordi Girona Salgado, Barcelona, Spain

Single-Pass List Partitioning Leonor Frias ∗ Universitat Polit`ecnica de Catalunya Dep. de Llenguatges i Sistemes Inform`atics Jordi Girona Salgado, Barcelona, Spain

Add to Reading List

Source URL: algo2.iti.kit.edu

Language: English - Date: 2008-05-15 11:50:35
20Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis February 1, 2011 Problem Set 1

Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis February 1, 2011 Problem Set 1

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2011-02-07 15:14:45